MIR closures of polyhedral sets
نویسندگان
چکیده
منابع مشابه
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objec...
متن کاملLearning from Polyhedral Sets
Parameterized linear systems allow for modelling and reasoning over classes of polyhedra. Collections of squares, rectangles, polytopes, and so on, can readily be defined by means of linear systems with parameters. In this paper, we investigate the problem of learning a parameterized linear system whose class of polyhedra includes a given set of example polyhedral sets and it is minimal.
متن کاملClosures of Discrete Sets in Compact Spaces
We consider the question of whether a compact space will always have a discrete subset whose closure has the same cardinality as the whole space. We obtain many positive results for compact spaces of countable tightness and a consistent negative result for a space of tightness and density ω1. Several authors have recently been investigating a notion called discretely reflexive where one seeks a...
متن کاملStrong polyhedral approximation of simple jump sets
We prove a strong approximation result for functions u ∈ W 1,∞(Ω \ J), where J is the union of finitely many Lipschitz graphs satisfying some further technical assumptions. We approximate J by a polyhedral set in such a manner that a regularisation term η(Div u), (i = 0, 1, 2, . . .), is convergent. The boundedness of this regularisation functional itself, introduced in [T. Valkonen: “Transport...
متن کاملComposition of Credal Sets via Polyhedral Geometry
Recently introduced composition operator for credal sets is an analogy of such operators in probability, possibility, evidence and valuationbased systems theories. It was designed to construct multidimensional models (in the framework of credal sets) from a system of lowdimensional credal sets. In this paper we study its potential from the computational point of view utilizing methods of polyhe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-008-0225-x